The location and location-routing problem for the refugee camp network design
نویسندگان
چکیده
The refugee crisis is one of the major challenges modern society. influxes refugees are usually sudden and in sheer need services such as health care, education safety. Planning public under an imminent humanitarian requires simultaneous strategic operational decisions. Inspired by a real-world problem that Red Crescent facing Southeast Turkey, we study locating camps planning transportation service providers from their institutions to located camps. Our modeling approach brings new facet location routing considering beneficiaries variables. We develop branch-price-and-cut algorithm for problem. To solve pricing problem, introduce cycle-eliminating using nested recursion generate elementary hop constrained shortest paths. best version our efficiently solves 244-node instances optimally.
منابع مشابه
Designing Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Latency Location-Routing Problem
This paper introduces the Latency Location-Routing Problem (LLRP) whose goal is to minimize waiting time of recipients by optimally determining both the locations of depots and the routes of vehicles. The LLRP is customer oriented by pursuing minimization of the latency instead of minimization of the length of routes. One of the main applications of this problem is the distribution of supplies ...
متن کاملPopmusic for the World Location Routing Problem
ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template...
متن کاملModelling and Solving the Capacitated Location-Routing Problem with Simultaneous Pickup and Delivery Demands
In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B-methodological
سال: 2021
ISSN: ['1879-2367', '0191-2615']
DOI: https://doi.org/10.1016/j.trb.2020.11.010